1485C - Floor and Mod - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
const int N=1e7+10;
#define ll long long int
#define pb push_back
//#define getUnique(v) {sort(v.begin(),v.end());v.erase(unique(v.begin(),v.end()),v.end());}
ll gcd(ll a,ll b){if(a%b==0)return b;return gcd(b,a%b);}
ll binexp(ll n,ll p){ll res = 1;while (p>0){if(p&1)res=res*n;n=n*n;p>>=1;}return res;}
void solve(){
    ll x,y;cin>>x>>y;
    ll ans=0;
    for(ll k=1;k<=50000;k++){
        ll leftboundary=k+2,rightboundary=min(y+1,x/k);
        if(rightboundary>=leftboundary)
            ans+=(rightboundary-leftboundary+1);
    }
    cout<<ans<<"\n";
}
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("error.txt", "w", stderr);
freopen("output.txt", "w", stdout);
#endif
    int t;cin>>t;
    while(t--)
        solve();
}